Modeling agents with the CSP formalism: an approach for optimization of distributed problems
نویسندگان
چکیده
Multi-Agent Systems (MAS) are an efficient approach to deal with distributed complex problems. However, they are slightly suited to optimization ones. In order to tackle this problem we present a model to specify Multi-Agent Systems with the Constraint Satisfaction Problem (CSP) formalism. It allows to take advantages from CSP solving algorithms and to deal with optimization problems. For this purpose we specify agents as Constraint Satisfaction and Optimization Problems, i.e. CSOP and consequently the MAS as a Distributed CSOP (DCSOP). We illustrate the interest of our approach on the antennae parameter setting problem which is an example of distributed constrained problem. We implement this specification to validate the optimization function model that we propose.
منابع مشابه
Distributed generative CSP framework for multi-site product configuration
Today’s configurators are centralized systems and do not allow manufacturers to cooperate on-line for offer-generation or sales-configuration. However, supply chain integration of configurable products requires the cooperation of the configuration systems from the different manufacturers that jointly offer solutions to customers. As a consequence, there is a high potential for methods that enab...
متن کاملThe Distributed Constraint Satisfaction Problem: Formalization and Algorithms
In this paper, we develop a formalism called a distributed constraint satisfaction problem (distributed CSP) and algorithms for solving distributed CSPs. A distributed CSP is a constraint satisfaction problem in which variables and constraints are distributed among multiple agents. Various application problems in Distributed Artificial Intelligence can be formalized as distributed CSPs. We pres...
متن کاملDBS multi-variables pour des problèmes de coordination multi-agents
The CSP formalism (Constraint Satisfaction Problem) can represent many problems in asimple and efficient way. However, some of these problems cannot be solved in a classical andcentralized way. The causes can be multiple: prohibitive repatriation time, unsecured data andso on. Distributed CSP (DisCSP), domain intersecting MAS and CSP, are used to model andto solve these problems...
متن کاملDistributed generative CSP approach towards multi-site product configuration
Today’s configurators are centralized systems and do not allow manufacturers to cooperate on-line for offer-generation or sales-configuration. However, supply chain integration of configurable products requires the cooperation of the configuration systems from the different manufacturers that jointly offer solutions to customers. As a consequence, there is a business requirement for methods tha...
متن کاملDistributed Constraint Reasoning
Distributed constraint reasoning is concerned with modeling and solving naturally distributed problems. It has application to the coordination and negotiation between semi-cooperative agents, namely agents that want to achieve a common goal but would not give up private information over secret constraints. When compared to centralized constraint satisfaction (CSP) and constraint optimization (C...
متن کامل